On the existence of min-max minimal torus
نویسنده
چکیده
In this paper, we will study the existence problem of minmax minimal torus. We use classical conformal invariant geometric variational methods. We prove a theorem about the existence of minmax minimal torus in Theorem 5.1. Firstly we prove a strong uniformization result(Proposition 3.1) using method of [1]. Then we use this proposition to choose good parametrization for our minmax sequences. We prove a compactification result(Lemma 4.1) similar to that of Colding and Minicozzi [2], and then give bubbling convergence results similar to that of Ding, Li and Liu [7]. In fact, we get an approximating result similar to the classical deformation lemma(Theorem 1.1).
منابع مشابه
01 3 Min - Max Theory and the Willmore Conjecture
In 1965, T. J. Willmore conjectured that the integral of the square of the mean curvature of a torus immersed in R is at least 2π. We prove this conjecture using the min-max theory of minimal surfaces.
متن کاملMINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
متن کاملPositive Solutions of Nonlinear Schrödinger Equation with Peaks on a Clifford Torus
We prove the existence of large energy positive solutions for a stationary nonlinear Schrödinger equation ∆u− V (x)u+ u = 0 in R with peaks on a Clifford type torus. Here V (x) = V (r1, r2, · · · , rs) = 1 + 1 (a1r 1 + a2r m 2 + a3r m 3 + ...+ asr m s ) + O ( 1 (a1r 1 + a2r m 2 + a3r m 3 + ...+ asr m s ) 1+τ ) where RN = RN1 × RN2 · · · × RNs , with Ni ≥ 2 for all i = 1, 2, ...s, m > 1, τ > 0, ...
متن کاملMinimal Adaptive Routing with LimitedInjection on
Virtual channels can be used to implement deadlock free adaptive routing algorithms and increase network throughput. Unfortunately, they introduce asymmetries in the use of buuers of symmetric networks as the toroidal k-ary n-cubes. In this paper we present a minimal adaptive routing algorithm that tries to balance the use of the virtual channels by limiting the injection of new packets into th...
متن کاملMinimal solution of fuzzy neutrosophic soft matrix
The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...
متن کامل